Decomposing the complete r -graph
نویسندگان
چکیده
منابع مشابه
Cyclically decomposing the complete graph into cycles
Let m1; m2; : : : ; mk be positive integers not less than 3 and let n= ∑k i=1 mi. Then, it is proved that the complete graph of order 2n+ 1 can be cyclically decomposed into k(2n+ 1) cycles such that, for each i= 1; 2; : : : ; k, the cycle of length mi occurs exactly 2n+ 1 times. c © 2003 Elsevier B.V. All rights reserved.
متن کاملOn Decomposing the Complete Graph into the Union of Two Disjoint Cycles
Let G of order n be the vertex-disjoint union of an even and an odd cycle. It is known that there exists a G-decomposition of K v for all v ≡ 1 (mod 2n). We use an extension of the Bose construction for Steiner triple systems and a recent result on the Oberwolfach Problem for 2-regular graphs with two components to show that there exists a G-decomposition of K v for for all v ≡ n (mod 2n), unle...
متن کاملDecomposing complete graphs into cubes
This talk concerns when the complete graph on n vertices can be decomposed into d-dimensional cubes, where d is odd and n is even. (All other cases have been settled.) Necessary conditions are that n ≡ 1 (mod d) and n ≡ 0 (mod 2). These are known to be sufficient for d equal to 3 or 5, but for larger values of d a decomposition has been proven to exist for only sparce sets of n. We prove that f...
متن کاملAll cycle-complete graph Ramsey numbers r(Cm, K6)
The cycle-complete graph Ramsey number r (Cm,Kn ) is the smallest integer N such that every graph G of order N contains a cycle Cm on m vertices or has independence number (G) n. It has been conjectured by Erdős, Faudree, Rousseau and Schelp that r (Cm,Kn )1⁄4 (m 1) (n 1)þ 1 for all m n 3 (except r (C3,K3 )1⁄4 6). This conjecture holds for 3 n 5: In this paper we will present a proof for n 1⁄4 ...
متن کاملDecomposing complete edge-chromatic graphs and hypergraphs
A d-graph G = (V ;E1, . . . , Ed) is a complete graph whose edges are colored by d colors, or in other words, are partitioned into d subsets (some of which might be empty). We say that G is complementary connected if the complement to each chromatic component of G is connected on V , or in other words, if for each two vertices u, w ∈ V and color i ∈ I = {1, . . . , d} there is a path between u ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2018
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2017.08.008